
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 2371. -- 鹰蛋2 -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>2371: 鹰蛋2</h2><span class=green>Time Limit: </span>2 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>128 MB<br><span class=green>Submit: </span>5&nbsp;&nbsp;<span class=green>Solved: </span>5<br>[<a href='submitpage.php?id=2371'>Submit</a>][<a href='problemstatus.php?id=2371'>Status</a>][<a href='bbs.php?id=2371'>Discuss</a>]</center><h2>Description</h2><div class=content><div style="text-indent: 21pt" align="left"><span style="color: black">一栋高F层的楼（每层按高度从1到F编号），你有很多个一模一样的鹰蛋。已知，如果某个鹰蛋从第i层摔下时会摔碎，则所有的蛋从j(j&gt;=i)层摔下时都会摔碎；同样的，如果某个鹰蛋从第i层摔下时不会摔碎，则所有的蛋从j(j&lt;=i)层摔下时都不会摔碎。</span></div>
<div style="text-indent: 21pt" align="left"><span style="color: black">现在定义Solvable(F,D,B)表示是否存在一种策略，使得你可以在实验不超过D次（摔一次蛋算一次实验），摔碎不超过B只鹰蛋的前提下，判断出这些鹰蛋从这栋高F的楼的每层摔下去时是否会摔碎。</span></div>
<div align="left"><b><span style="font-size: 12pt; color: black">Your Task</span></b></div>
<div style="text-indent: 21pt" align="left"><span style="color: black">给定F D B满足Solvable(F,D,B)，求最大的FF满足Solvable(FF,D,B)（若</span><span style="color: black">则返回-1），最小的DD满足Solvable(F,DD,B)，最小的BB满足Solvable(F,D,BB)。</span></div></div><h2>Input</h2><div class=content><div style="text-indent: 21pt" align="left"><span style="color: black">第一行T表示数据组数</span></div>
<div style="text-indent: 21pt" align="left"><span style="color: black">对于每组数据，一行中F D B</span></div></div><h2>Output</h2><div class=content><div style="text-indent: 21pt" align="left"><span style="color: black">对于每组数据，在一行中输出FF DD BB</span></div></div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>2<br />
3 3 3<br />
7 5 3<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>7 2 1<br />
25 3 2<br />
</span></div><h2>HINT</h2>
			<div class=content><p><p>数据约定<br /><br />
100%：T&lt;=10,1&lt;=F,D,B&lt;=2*10^9</p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search='></a></p></div><center>[<a href='submitpage.php?id=2371'>Submit</a>][<a href='problemstatus.php?id=2371'>Status</a>][<a href='bbs.php?id=2371'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
